Finding the shortest path in stochastic networks
نویسندگان
چکیده
منابع مشابه
Finding objects through stochastic shortest path problems
This paper presents a novel formulation for the problem of finding objects in a known environment while minimizing the search cost. Our approach consists in formalizing this class of problems as Stochastic Shortest Path (SSP) problems, a decision-theoretic framework for probabilistic environments. The obtained problems are solved by using offthe-shelf domain-independent probabilistic planners. ...
متن کاملALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملGenetic Algorithm Finding the Shortest Path in Networks
With the growth of the Internet, Internet Service Providers (ISPs) try to meet the increasing traffic demand with new technology and improved utilization of existing resources. Routing of data packets can affect network utilization. Packets are sent along network paths from source to destination following a protocol. Open Shortest Path First (OSPF) is the most commonly used intra-domain Interne...
متن کاملFinding Risk-Averse Shortest Path with Time-Dependent Stochastic Costs
In this paper, we tackle the problem of risk-averse route planning in a transportation network with time-dependent and stochastic costs. To solve this problem, we propose an adaptation of the A* algorithm that accommodates any risk measure or decision criterion that is monotonic with first-order stochastic dominance. We also present a case study of our algorithm on the Manhattan, NYC, transport...
متن کاملReliable shortest path finding in stochastic networks with spatial correlated link travel times
Reliable shortest path finding in stochastic networks with spatial correlated link travel times Bi Yu Chen a b , William H.K. Lam a , Agachai Sumalee a & Zhi-lin Li c a Department of Civil and Structural Engineering, The Hong Kong Polytechnic University, Hong Kong, PR China b State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, Wuhan, PR Ch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2007
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2007.01.012